dynamic data structures造句
例句与造句
- Algorithms for problems of this type typically involve dynamic data structures.
- Broadly the implementation of these linked data structure is through dynamic data structures.
- An important application of recursion in computer science is in defining dynamic data structures such as trees.
- An important application of recursion in computer science is in defining dynamic data structures such as Lists and Trees.
- Operations performed on the new dynamic data structure may involve traversing \ log _ { 2 } \ left ( n \ right ) sets formed by decomposition.
- It's difficult to find dynamic data structures in a sentence. 用dynamic data structures造句挺难的
- In 2013, Timothy M . Chan developed a simpler algorithm that avoids the need for dynamic data structures and eliminates the logarithmic factor, lowering the best known running time for d e " 3 to O ( n ^ { d / 2 } ).
- Simple implicit data structures, such as representing a sorted list as an array, may be very efficient as a static data structure, but inefficient as a dynamic data structure, due to modification operations ( such as insertion in the case of a sorted list ) being inefficient.
- For example, in many applications of computer graphics a common problem is to find which area on the screen is clicked by a CAD applications the changing input data are often stored in dynamic data structures, which may be exploited to speed-up the point-in-polygon queries.